Hash Tables for a Digital Lexicon

نویسندگان

چکیده

This paper deals with the construction of digital lexicons within scope Natural Language Processing. Data Structures called Hash Tables have demonstrated to generate good results for Interface Databases and data dispersion, response speed programming simplicity as main features. The storage desired information is done by associating a key through hashing functions that responsible distributing in this table. objective present tool Visual TaHs uses sparse table real lexicon (Lexicon Herbs), improving performance several implemented hash functions. Such structure has achieved satisfactory terms when compared conventional databases can work various media, such desktop, Web mobile.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Cuckoo++ Hash Tables: High-Performance Hash Tables for Networking Applications

Hash tables are an essential data-structure for numerous networking applications (e.g., connection tracking, rewalls, network address translators). Among these, cuckoo hash tables provide excellent performance by allowing lookups to be processed with very few memory accesses (2 to 3 per lookup). Yet, for large tables, cuckoo hash tables remain memory bound and each memory access impacts perform...

متن کامل

Hash in a Flash: Hash Tables for Solid State Devices

In recent years, information retrieval algorithms have taken center stage for extracting important data in ever larger datasets. During computation, these datasets are both stored in memory and on disk. As datasets become larger demand for superior storage solutions will rise. Advances in hardware technology have lead to the increasingly wide spread use of flash storage devices. Such devices ha...

متن کامل

Distributed Paged Hash Tables

In this paper we present the design and implementation of DPH, a storage layer for cluster environments. DPH is a Distributed Data Structure (DDS) based on the distribution of a paged hash table. It combines main memory with file system resources across the cluster in order to implement a distributed dictionary that can be used for the storage of very large data sets with key based addressing t...

متن کامل

Optimal Dynamic Hash Tables

Hash-based data structures, which use randomization in order to represent efficiently a list of elements, are one of the most-used data structures in networking applications, where both time and fast memory are scarce resources. This paper investigates the realistic scenario in which elements are not only added to the data structure but also deleted. We show that when the memory is bounded, dyn...

متن کامل

1 Hash Tables

Pat Morin Carleton University 1.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Revista de Informática Teórica e Aplicada

سال: 2021

ISSN: ['2340-9711', '2386-7027']

DOI: https://doi.org/10.22456/2175-2745.107128